Dempster’s Rule as Seen by Little Coloured Balls

نویسندگان

  • Audun Jøsang
  • Javier Diaz
  • Simon Pope
  • Bernadette Bouchon-Meunier
چکیده

Dempster’s Rule is commonly described as an operator for fusing beliefs. While there are different possible interpretations of belief fusion, there is considerable confusion regarding the exact type of belief fusion that Dempster’s rule performs. Many alternative operators for belief fusion have been proposed, where some are based on the same fundamental principle as Dempster’s rule, and others have a totally different basis, such as the Bayesian cumulative operator. In this article we take a closer look at Dempster’s rule in order to determine exactly what type of belief fusion it performs. Our conclusion is that Dempster’s rule in fact represents a method for serial combination of probabilistic constraints, which is not suitable for fusing different beliefs on the same frame of discernment. We conclude that the non-normalised version of Dempster’s rule represents a method for multiplying orthogonal beliefs on product frames of discernment.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dempster's Rule as Seen by Little Colored Balls

Dempster’s rule is traditionally interpreted as an operator for fusing belief functions. While there are different types of belief fusion, there has been considerable confusion regarding the exact type of operation that Dempster’s rule performs. Many alternative operators for belief fusion have been proposed, where some are based on the same fundamental principle as Dempster’s rule, and others ...

متن کامل

On the behavior of Dempster’s rule of combination

In this paper we present simple examples showing the insensitivity of Dempster’s rule of combination proposed in Dempster-Shafer Theory (DST) of evidence with respect to the level of conflict between two sources of evidences. Aside famous Zadeh’s example on the validity of Dempster’s rule of combination, it is shown that for an infinite number of cases Dempster’s rule does not respond adequatel...

متن کامل

An Improved Dempster-Shafer Algorithm Using a Partial Conflict Measurement

Multiple evidences based decision making is an important functionality for computers and robots. To combine multiple evidences, mathematical theory of evidence has been developed, and it involves the most vital part called Dempster’s rule of combination. The rule is used for combining multiple evidences. However, the combined result gives a counterintuitive conclusion when highly conflicting ev...

متن کامل

Geometry of Dempster’s Rule

In this paper we analyze the nature of Shafer’s belief functions as geometric entities. We focus on the geometric behavior of Dempster’s rule of combination in the context of the belief space, i.e. the set of all the admissible belief functions defined over a given finite domain. After showing how convex closure and orthogonal sum commute in the belief space and introducing the concept of condi...

متن کامل

Dual Properties of the Relative Belief of Singletons

In this paper we prove that a recent Bayesian approximation of belief functions, the relative belief of singletons, meets a number of properties with respect to Dempster’s rule of combination which mirrors those satisfied by the relative plausibility of singletons. In particular, its operator commutes with Dempster’s sum of plausibility functions, while perfectly representing a plausibility fun...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005